Optimal semi-online algorithms for machine covering
نویسندگان
چکیده
منابع مشابه
Optimal semi-online algorithms for machine covering
This paper investigates the semi-online machine covering problems on m ≥ 3 parallel identical machines. Three different semi-online versions are studied and optimal algorithms are proposed. We prove that if the total processing time of all jobs or the largest processing time of all jobs is known in advance, the competitive ratios of the optimal algorithms are both m − 1. If the total processing...
متن کاملOptimal Semi-online Algorithms for Scheduling with Machine Activation Cost
We investigate the following two semi-on-line scheduling problems with machine activation cost. We are given two potential identical machines to non-preemptively process a sequence of independent jobs. Machines need to be activated before starting to process, and each machine activated incurs a fixed machine activation cost. No machines are initially activated, and when a job is revealed the al...
متن کاملOptimal Semi-Online Algorithm for Machine Covering with Nonsimultaneous Machine Available Times
This paper investigates machine covering problem on m > 3 parallel indentical machines with nonsimultaneous machine available times. If the total processing time of all jobs and the largest processing time of all jobs are both known in advance, we can obtain an optimal algorithm with competitive ratio m − 2. Mathematics Subject Classification: 68M20, 90B35
متن کاملA Note on Semi-online Machine Covering
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm is given in advance the optimal value of the smallest load for the given instance, and then the jobs are scheduled one by one as they arrive, without any knowledge of the following jobs. We present a deterministic algo...
متن کاملSemi-online machine covering for two uniform machines
The machine covering problem deals with partitioning a sequence of jobs among a set of machines, so as to maximize the completion time of the least loaded machine. We study a semi-online variant, where jobs arrive one by one, sorted by non-increasing size. The jobs are to be processed by two uniformly related machines, with a speed ratio of q ≥ 1. Each job has to be processed continuously, in a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.11.015